Nondeterministic polynomial time factoring in the tile assembly model
نویسندگان
چکیده
منابع مشابه
Nondeterministic polynomial time factoring in the tile assembly model
Formalized study of self-assembly has led to the definition of the tile assembly model, Previously I presented ways to compute arithmetic functions, such as addition and multiplication, in the tile assembly model: a highly distributed parallel model of computation that may be implemented using molecules or a large computer network such as the Internet. Here, I present tile assembly model system...
متن کاملFactoring a Graph in Polynomial Time
The Cartesian product G x H of graphs G and H has as vertices the pairs (g, h) with g a vertex of G and h a vertex of H; (gl, hI) is connected by an edge to (g2' h2) in G x H just when {gl' g2} is an edge of G and hI = h2' or when g, = g2 and {h" h2} is an edge of H. The Cartesian product admits unique factorization (Sabidussi [4]) but until recently no efficient algorithm was known for produci...
متن کاملPath finding in the tile assembly model
Swarm robotics, active self-assembly, and amorphous computing are fields that focus on designing systems of large numbers of small, simple components that can cooperate to complete complex tasks. Many of these systems are inspired by biological systems, and all attempt to use the simplest components and environments possible, while still being capable of achieving their goals. The canonical pro...
متن کاملPolynomial time factoring algorithm using Bayesian arithmetic
In a previous paper, we have shown that any Boolean formula can be encoded as a linear programming problem in the framework of Bayesian probability theory. When applied to NP-complete algorithms, this leads to the fundamental conclusion that P = NP. Now, we implement this concept in elementary arithmetic and especially in multiplication. This provides a polynomial time deterministic factoring a...
متن کاملExpressive Reasoning about Action in Nondeterministic Polynomial Time
The rapid development of efficient heuristics for deciding satisfiabil ity for proposit ional logic motivates thorough investigations of the usabili ty of NP-complete problems in general. In this paper we introduce a logic of action and change which is expressive in the sense that it can represent most proposit ional benchmark examples in the l i terature, and some new examples involving parall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.07.051